Type-of-Service Routing in Dynamic Datagram Networks

We propose a new approach to achieving type-of-service (TOS) with adaptive next-hop routing in wide-area networks such as the Internet. We consider two traac classes, namely delay-sensitive and throughput-sensitive. Our approach uses two FCFS queues at each outgoing link, one for each TOS; the link is shared cyclicly between the two TOS queues. The next-hops for the delay-sensitive traac adapts to link delays of that traac. The next-hops for the throughput-sensitive traac adapts to overall link utilizations. We compare our approach with a traditional approach using discrete-event simulation and Liapunov analysis (for stability of routes). The proposed approach ooers lower end-to-end delays as it isolates the routes of the two traac classes.